#include <iostream>
#include<string>
using namespace std;
int main()
{
    int n = 0;
    cin >> n;
    string tmp = to_string(n);
    for (auto& ch : tmp)
    {
        if ((ch - '0') % 2) ch = 1;
        else ch = 0;
    }
    int i = 0;
    while (i < tmp.size() - 1 && tmp[i] == 0) i++;
    while (i < tmp.size())
    {
        if ((tmp[i] - '0') % 2) cout << 1;
        else cout << 0;
        i++;
    }
    return 0;
}

#include <iostream>
using namespace std;
#include<cstdio>

const int N = 1e6 + 10;
typedef long long LL;
LL n, m;
LL row[N], col[N];
int main()
{
    cin >> n >> m;
    LL arr[100][100];
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
           // scanf("%lld", &arr[i][j]);
            row[i] += arr[i][j];
            col[j] += arr[i][j];
        }
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            printf("%lld ", row[i] + col[j] - arr[i][j]);
        }
        printf("\n");
    }
    return 0;
}

#include <iostream>
using namespace std;
int n, k;
const int N = 1e5 + 10;
typedef long long LL;
LL h[N], s[N];
int main()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> h[i];
    for (int i = 1; i <= n; i++) cin >> s[i];
    int left = 1, right = 1;
    LL hsum = 0, ssum = 0, hmax = 0, smin = 0;
    int begin = 0;
    while (right <= n)
    {
        hsum += h[right];
        ssum += s[right];
        while (right - left + 1 > k)
        {
            hsum -= h[left];
            ssum -= s[left];
            left++;
        }
        if (right - left + 1 == k)
        {
            if (hsum > hmax)
            {
                begin = left;
                hmax = hsum;
                smin = ssum;
            }
            else if (hsum == hmax && ssum < smin)
            {
                begin = left;
                hmax = hsum;
                smin = ssum;
            }
        }
        right++;
    }
    cout << begin << endl;
    return 0;
}